The independence number of graphs in terms of degrees
نویسندگان
چکیده
منابع مشابه
a cross-comparative dtudy between two textbook series in terms of the presentation of politeness
چکیده ندارد.
15 صفحه اولa synchronic and diachronic approach to the change route of address terms in the two recent centuries of persian language
terms of address as an important linguistics items provide valuable information about the interlocutors, their relationship and their circumstances. this study was done to investigate the change route of persian address terms in the two recent centuries including three historical periods of qajar, pahlavi and after the islamic revolution. data were extracted from a corpus consisting 24 novels w...
15 صفحه اولinvestigating the translation expectancy norms of iranian college student readership in terms of english fiction in persian
مفهوم هنجار برای اولین بار توسط دانشمندی به نام گیدون توری در اواخر دهه 70 مطرح شد. هنجارها توسط محققان مختلفی طبقه بندی شده اند؛ نوع هنجاری که در این تحقیق مورد بحث است "هنجار انتظارات" است. مطالعات ترجمه یک رشته ی نوپا و مستقل است که هنوز به رشد کامل خود نرسیده و بسیاری از شاخه های آن نیاز به پژوهش دارند. یکی ازاین حوزه ها که نیاز به پژوهش دارند، هنجارهای ترجمه هستند به ویژه هنجارهای انتظارات...
Independence, irredundance, degrees and chromatic number in graphs
Let (G) and IR(G) denote the independence number and the upper irredundance number of a graph G. We prove that in any graph of order n, minimum degree and maximum degree =0, IR(G)6 n=(1 + = ) and IR(G) − (G)6 (( − 2)=2 )n. The two bounds are attained by arbitrarily large graphs. The second one proves a conjecture by Rautenbach related to the case = 3. When the chromatic number of G is less than...
متن کاملUpper bounds for the 2-hued chromatic number of graphs in terms of the independence number
A 2-hued coloring of a graph G (also known as conditional (k, 2)-coloring and dynamic coloring) is a coloring such that for every vertex v ∈ V (G) of degree at least 2, the neighbors of v receive at least 2 colors. The smallest integer k such that G has a 2-hued coloring with k colors, is called the 2-hued chromatic number of G and denoted by χ2(G). In this paper, we will show that if G is a re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90307-f